Modified Incomplete Cholesky Preconditioned Conjugate Gradient Algorithm on GPU for the 3D Parabolic Equation
نویسندگان
چکیده
In this study, for solving the three-dimensional partial differential equation ut = uxx + uyy + uzz, an efficient parallel method based on the modified incomplete Cholesky preconditioned conjugate gradient algorithm (MICPCGA) on the GPU is presented. In our proposed method, for this case, we overcome the drawbacks that the MIC preconditioner is generally difficult to be parallelized on the GPU due to the forward/backward substitutions, and thus present an efficient parallel implementation method on the GPU. Moreover, a vector kernel for the sparse matrix-vector multiplication, and optimization of vector operations by grouping several vector operations into a single kernel are adopted. Numerical results show that our proposed forward/backward substitutions and MICPCGA on the GPU both can achieve a significant speedup, and compared to an approximate inverse SSOR preconditioned conjugate gradient algorithm (SSORPCGA), our proposed MICPCGA obtains a bigger speedup, and outperforms it in solving the three-dimensional partial differential equation.
منابع مشابه
An Improved Implementation of Preconditioned Conjugate Gradient Method on GPU
An improved implementation of the Preconditioned Conjugate Gradient method on GPU using CUDA (Compute Unified Device Architecture) is proposed. It aims to solving the Poisson equation arising in liquid animation with high efficiency. We consider the features of the linear system obtained from the Poisson equation and propose an optimization method to solve it. First, a novel storage format call...
متن کاملScallability Analysis of Parallel Mic(0) Preconditioning Algorithm for 3d Elliptic Problems
Novel parallel algorithms for the solution of large FEM linear systems arising from second order elliptic partial differential equations in 3D are presented. The problem is discretized by rotated trilinear nonconforming Rannacher–Turek finite elements. The resulting symmetric positive definite system of equations Ax = f is solved by the preconditioned conjugate gradient algorithm. The precondit...
متن کاملComparative Analysis of High Performance Solvers for 3D Elliptic Problems
The presented comparative analysis concerns two iterative solvers for 3D linear boundary value problems of elliptic type. After applying the Finite Difference Method (FDM) or the Finite Element Method (FEM) discretization a system of linear algebraic equations has to be solved, where the stiffness matrix is large, sparse and symmetric positive definite. It is well known that the preconditioned ...
متن کاملParallel MIC(0) preconditioning of 3D elliptic problems discretized by Rannacher-Turek finite elements
Novel parallel algorithms for the solution of large FEM linear systems arising from second order elliptic partial differential equations in 3D are presented. The problem is discretized by rotated trilinear nonconforming Rannacher–Turek finite elements. The resulting symmetric positive definite system of equations Ax = f is solved by the preconditioned conjugate gradient algorithm. The precondit...
متن کاملA Multigrid Preconditioner for the Semiconductor Equations
A multigrid preconditioned conjugate gradient algorithm is introduced into a semiconductor device modeling code DANCIR This code simulates a wide variety of semiconductor devices by numerically solving the drift di usion equations The most time consuming aspect of the simulation is the solution of three linear systems within each iteration of the Gummel method The original version of DANCIR use...
متن کامل